OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set

Source URL: ludovicpatey.com

• Computability theory
• Mathematical logic
• Proof theory
• Theory of computation
• Logic in computer science
• Computable function
• Reverse mathematics
• PA degree
• Peano axioms

Review TRENDS in Cognitive Sciences Vol.8 No.8 August 2004

Source URL: eccl.mit.edu

• Statistics
• Philosophy
• Logic
• Conditionals
• Graphical models
• Statistical inference
• Statistical models
• Philosophy of science
• Causality
• Bayesian network
• Conditional probability
• Counterfactual conditional

Things that can and things that can’t be done in PRA Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade, Bldg. 540

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Mathematical logic
• Mathematics
• Theoretical computer science
• Primitive recursive function
• Primitive recursive arithmetic
• ELEMENTARY
• Reverse mathematics
• Pairing function
• Ackermann function
• Sequence
• Recursion

c ACM, 2009. This is the author’s version of the work. It is posted here by permission of ACM for your personal use. ° Not for redistribution. The definitive version was published in the Proceedings of the Haskell Sym

Source URL: ndmitchell.com

• Software engineering
• Declarative programming
• Computer programming
• Lambda calculus
• Functional programming
• Subroutines
• Formal methods
• Theoretical computer science
• Combinatory logic
• Let expression
• Lambda lifting
• Anonymous function

On the Study of the Ethernet Franz T. Shenkrishnan, Ph.D. 1 Motivation

Source URL: pdos.csail.mit.edu

• Applied mathematics
• Computational neuroscience
• Computational statistics
• Algorithm
• Mathematical logic
• Theoretical computer science
• Artificial neural network
• Mathematics

Towards Rigorously Faking Bidirectional Model Transformations Christopher M. Poskitt1? , Mike Dodds2 , Richard F. Paige2 , and Arend Rensink3 1 Department of Computer Science, ETH Z¨urich, Switzerland

Source URL: se.inf.ethz.ch

• Systems engineering
• Graph rewriting
• Unified Modeling Language
• Model transformation
• Data transformation
• Model checking
• Mathematical logic

B.S. in Computational Linguistics Students must complete the College of Arts and Sciences Education (CASE) requirements. B.S./M.S. coursework can count towards the Social and Historical Studies and Natural and Mathematic

Source URL: cl.indiana.edu

• Cognitive science
• Formal sciences
• Artificial intelligence
• Computer science education
• Informatics
• Information science
• Computer science
• Logic
• Computational linguistics

Intuitionistic choice and restricted classical logic Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade

Source URL: www.mathematik.tu-darmstadt.de

• Symbol
• Operator theory
• Proof theory
• Differential forms on a Riemann surface
• It diffusion

A Tractable First-Order Probabilistic Logic Pedro Domingos and W. Austin Webb Department of Computer Science and Engineering University of Washington Seattle, WA, U.S.A. {pedrod, webb}@cs.washington.edu

Source URL: homes.cs.washington.edu

E XTENDED C ALL FOR P APERS 15 th CONGRESS OF LOGIC, METHODOLOGY, AND PHILOSOPHY OF SCIENCE (CLMPS 2015)   University  of  Helsinki,  Finland,  3-­‐8  August  2015  

Source URL: clmps.helsinki.fi